String / Binary string (Bibtex)

P387: Enumeration of all binary string with fixed number ones

Input:

Two integers $n$ and $k$, where $n \ge k$.

Output:

All binary string with length $n$ and $k$ ones.

Complexity:

$O(1)$ time per binary string.

Comment:

Reference:

[Bitner1976] (Bibtex)

P354: Enumeration of all bitstrings of length $n$ that contains exactly $k$ 1's

Input:

An even integer $n$ and odd integer $k$.

Output:

All bitstrings of length $n$ that contains exactly $k$ 1's.

Complexity:

$O(1)$ amortized time per solution.

Comment:

Reference:

[Ruskey1988] (Bibtex)